#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;

int e[N], ne[N], h[N], idx;
int n;
double p, r;

double res;
int cnt = 0;


void add(int a, int b) {
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}

void dfs(int u, double p, double r) {
    if (h[u] == -1) {
        if (p > res) {
            res = p;
            cnt = 1;
        } else if (p == res) {
            cnt ++;
        } else {
            return ;
        }
    }

    for (int i = h[u]; i != -1; i = ne[i]) {
        int j = e[i];
        dfs(j, p * r, r);
    }
}

inline void solution() {
    cin >> n >> p >> r;
    mm(h, -1);
    int root = 0;
    for (int i = 0; i < n; i ++ ) {
        int parent;
        cin >> parent;
        if (parent != -1)
            add(parent, i);
        else 
            root = i;
    }
    res = p;
    dfs(root, p, (100 + r) / 100);
    printf("%.2lf %d\n", res, cnt);
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}